Paul Bracher Chem 30 – Section 5 Section Solution Set Carbonyl Chemistry and Carboxylic Acid Derivatives Problem 1 An alternative to using UV irradiation to effect cis/trans isomerization of an olefin is treatment with

Source URL: www.paulbracher.com

• Functional groups
• Grignard reaction
• Acid
• Carboxylic acid
• Alkene
• Wittig reaction
• Oxide
• Protic solvent

MCS 401 – Computer Algorithms I Spring 2016 Problem Set 1 Lev Reyzin Due: by the beginning of class

Source URL: homepages.math.uic.edu

• Theoretical computer science
• Algorithm
• Mathematical logic
• Big O notation

Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 1, duepts) Consider the following two networks: 1

Source URL: tuvalu.santafe.edu

• Graph theory
• Network theory
• Algebraic graph theory
• Networks
• Network analysis
• Centrality
• Betweenness centrality
• Graph
• Vertex
• Adjacency matrix
• Adjacency list
• Network science

Ec721 PROBLEM SET 2 SOLUTIONS 1. There are two individuals A and B whose incomes are perfectly negatively correlated: with probability half, A earns y + ∆ (where ∆ > 0) while B earns y − ∆, while with probability

Source URL: people.bu.edu

CS261: Problem Set #3 Due by 11:59 PM on Tuesday, February 23, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions: We are using Gr

Source URL: theory.stanford.edu

• Operations research
• Linear programming
• Mathematical optimization
• Convex optimization
• Algorithm
• Candidate solution
• Simplex algorithm
• Linear programming relaxation

CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016

Source URL: theory.stanford.edu

• NP-complete problems
• Knapsack problem
• Set cover problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• Greedy algorithm
• Dynamic programming
• Minimum spanning tree
• Algorithm
• Time complexity
• NP

1. PROBLEM SET FOR “DIFFERENTIAL GEOMETRY II” AKA “ANALYSIS AND GEOMETRY ON MANIFOLDS” WINTER TERMProblem 1. Let X be a topological space, x ∈ X and n ≥ 0. Show that the following statements are equi

Source URL: carsten.codimi.de

• Analytic geometry
• Coordinate system
• Sine
• Surfaces
• Differential topology
• Geometric topology

ES265 - Problem Set 6 - Due Thurs 10th March 2016 General Advice Problems are divided into S(mall), M(edium) and L(arge). Small problems shouldn’t take you more than a couple of minutes. You should not need to use calc

Source URL: www.es.ucsc.edu

• Wave mechanics
• Waves
• Acoustics
• Seismology
• Frequency
• Wavelength
• Wind wave
• Internal wave
• Wave
• Surface wave

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

Source URL: www-bcf.usc.edu

• Operations research
• Linear programming
• Convex optimization
• Combinatorial optimization
• Computational complexity theory
• Submodular set function
• Randomized rounding
• Optimization problem
• Matroid
• Ellipsoid method
• Mathematical optimization
• Mechanism design

Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1

Source URL: community.dur.ac.uk

• NP-complete problems
• Chordal graph
• Bipartite graph
• Clique problem
• Interval graph
• Claw-free graph
• Clique
• Graph minor
• Perfect graph
• Split graph
• Independent set
• Graph